Algorithms for 2D Line Clipping
نویسندگان
چکیده
New algorithms for 2D line clipping against convex, non-convex windows and windows that consist of l inear edges and arcs are being presented. Algorithms were derived from the Cohen-Sutherland 's and Liang-Barsky s algorithms. The general algorithm with linear edges and arcs can be used especially for engineering drafting systems. Algorithms are easy to modify in order to deal with holes too. The presented algorithms have been verified in TURBO-PASCAL. Because of the unifying approach to the clipping problem solution all algorithms are simple, easy to understand and implement.
منابع مشابه
A Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space which uses the parametric equation of the line. This algorithm further easily extended to the polygon clipping by considering the edge of the polygo...
متن کاملComputing Contour Line from 2d Scalar Field of High Degree through Bezier Clipping
The contour line is one of the most important features of 2D scalar field in scientific visualization. A new method for contour line extraction is presented in this paper. Unlike the existing methods, the contour line is extracted in image space. In order to accelerate root-finding procedure, Bezier clipping and subdivision algorithm are used in the proposed method. Cross scan-line algorithm is...
متن کاملThe Line Clipping Algorithm Basing on Affine Transformation
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the lin...
متن کاملO(lgN) Line Clipping Algorithm in E2
A new O N (lg ) line clipping algorithm in E against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.
متن کاملA Fast Algorithm for Line Clipping by Convex Polyhedron in E3
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O N ( ) . The suggested algorithm has O N ( ) complexity in the worst case and expected O N ( ) complexity. The speed up is achieved because of "known order" of triangle...
متن کامل